Measures of Effectiveness for BMD Mid-Course Tracking on MIMD Massively Parallel Computers

نویسنده

  • J. P. VanDyke
چکیده

The TRC code, a mid-course tracking code for ballistic missiles, has previously been implemented on a 1024-processor MIMD (Multiple Instruction Multiple Data) massively parallel computer. Measures of Effectiveness (MOE) for this algorithm have been developed for this computing environment. The MOE code is run in parallel with the TRC code. Particularly useful MOEs include the number of missed objects (real objects for which the TRC algorithm did not construct a track); of ghost tracks (tracks not corresponding to a real object); of redundant tracks (multiple tracks corresponding to a single real object); and of unresolved objects (multiple objects corresponding to a single track). All of these are expressed as a function of time, and tend to maximize during the time in which real objects are spawned (multiple reentry vehicles per post-boost vehicle). As well, it is possible to measure the track-truth separation as a funGtion of time. A set of calculations is presented illustrating these MOEs as a function of time for a case with 99 postboost vehicles, each of which spawns 9 reentry vehicles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massively Parallel Methods

Massively parallel computers promise unique power for engineering and scientific simulations. Development of parallel software tools and algorithms that take full advantage of this power is a continuing challenge to computational researchers. In this paper we discuss the advantages a message-passing multiple-instruction/multiple-data (MIMD) programming approach has for parallel simulations and ...

متن کامل

A Heterogeneous Graphics Procedure for Visualization of Massively Parallel Solutions *

P. J. Crossno, et. al. * Accepted for presentation at ASME Fluids Engineering Conference, June 20-24, 1993 Washington, D.C. ABSTRACT Scientific visualization is playing an increasingly important role in the analysis and interpretation of massively parallel CFD simulations due to the enormous volume of data that can be generated on these machines. In this paper we will describe the development o...

متن کامل

Architectural Models and Design Methodologies for General-purpose Highly-parallel Computers

We review the main research issues and problems in the area of general-purpose, massively parallel MIMD computers. It will be shown that the successful exploitation of this class of systems depends on the ability to deene and experiment with design methodol-ogies taking into account several aspects: abstract machine architecture, physical machine architecture, parallelizing and restructuring to...

متن کامل

A Parallel Algorithm for Graph Matching and Its MasPar Implementation

Search of discrete spaces is important in combinatorial optimization. Such problems arise in artificial intelligence, computer vision, operations research, and other areas. For realistic problems, the search spaces to be processed are usually huge, necessitating long computation times, pruning heuristics, or massively parallel processing. We present an algorithm that reduces the computation tim...

متن کامل

Modied Cyclic Algo- Rithms for Solving Triangular Systems on Distributed-memory Multiprocessors, Siam Complexity of Dense-linear-system Solution on a Multi- Processor Ring

We describe an e ort to implement the LINPACK Benchmark on two massively parallel distributed memory MIMD computers, the Intel iPSC/860 and DELTA Systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007